Performance and Limitation Review of Secure Hash Function Algorithm
نویسندگان
چکیده
منابع مشابه
The Whirlpool Secure Hash Function
In this paper, we describe Whirlpool, which is a block-cipher-based secure hash function. Whirlpool produces a hash code of 512 bits for an input message of maximum length less than 2 bits. The underlying block cipher, based on the Advanced Encryption Standard (AES), takes a 512-bit key and operates on 512-bit blocks of plaintext. Whirlpool has been endorsed by NESSIE (New European Schemes for ...
متن کاملAn Improved Fast and Secure Hash Algorithm
Recently, a fast and secure hash function SFHA – 256 has been proposed and claimed as more secure and as having a better performance than the SHA – 256. In this paper an improved version of SFHA – 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and im...
متن کاملA Three-Property-Secure Hash Function
This paper proposes a new hash construction based on the widely used Merkle-Damg̊ard (MD) iteration [Mer90,Dam90]. It achieves the three basic properties required from a cryptographic hash function: collision (Coll), second preimage (Sec) and preimage (Pre) security. We show property preservation for the first two properties in the standard security model and the third Pre security property is p...
متن کاملA Fast Provably Secure Cryptographic Hash Function
We propose a family of fast and provably secure cryptographic hash functions. The security of these functions relies directly on the well-known syndrome decoding problem for linear codes. Attacks on this problem are well identified and their complexity is known. This enables us to study precisely the practical security of the hash functions and propose valid parameters for implementation. Furth...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Recent and Innovation Trends in Computing and Communication
سال: 2019
ISSN: 2321-8169
DOI: 10.17762/ijritcc.v7i6.5323